Triviality Arguments Reconsidered

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicollinearity Reconsidered

In this paper we intend to improve the explanatory power of regressions when the deletion method is used for the remedy of Multicolinearity. If one deletes the variable (s) that is (are) responsible for Multicolinearity, he loses some information that is not common between the deleted variable (s) and the other remaining variables in the regression. To improve this method, we run the deleted va...

متن کامل

Triviality Pursuit

The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas...

متن کامل

Routes to Triviality

It is known that a number of inference principles can be used to trivialise the axioms of naı̈ve comprehension — the axioms underlying the naı̈ve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naı̈ve comprehension.

متن کامل

Schnorr triviality and genericity

We study the connection between Schnorr triviality and genericity. We show that while no 2-generic is Turing equivalent to a Schnorr trivial and no 1-generic is tt-equivalent to a Schnorr trivial, there is a 1-generic that is Turing equivalent to a Schnorr trivial. However, every such 1-generic must be high. As a corollary, we prove that not all K-trivials are Schnorr trivial. We also use these...

متن کامل

Reportrapport Declarative Interpretations Reconsidered Declarative Interpretations Reconsidered

Three semantics have been proposed as the most promising candidates for a declarative interpretation for logic programs and pure Prolog programs: the least Herbrand model, the least term model, i.e. the C-semantics, and the S-semantics. Previous results show that a strictly increasing information ordering between these semantics exists for the class of all programs. In particular, the S-semanti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Minds and Machines

سال: 2019

ISSN: 0924-6495,1572-8641

DOI: 10.1007/s11023-019-09501-x